skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


  • Home
  • Search Results
  • Page 1 of 1

Search for: All records

Creators/Authors contains: "Zhang, Jingru"

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. ; (, To appear in Proceeding of the 18th Annual International Conference on Combinatorial Optimization and Applications (COCOA 2025))
    Free, publicly-accessible full text available November 28, 2026
  2. ; (, arXiv preprint arXiv:2504.14803)
    Free, publicly-accessible full text available April 21, 2026
  3. ; (, Journal of Combinatorial Optimization)
    Abstract We study the two-center problem on cactus graphs in facility locations, which aims to place two facilities on the graph network to serve customers in order to minimize the maximum transportation cost. In our problem, the location of each customer is uncertain and may appear atO(m) points on the network with probabilities. More specifically, given are a cactus graphGand a set$$\mathcal {P}$$ P ofn(weighted) uncertain points where every uncertain point hasO(m) possible locations onGeach associated with a probability and is of a non-negative weight. The problem aims to compute two centers (points) onGso that the maximum (weighted) expected distance of thenuncertain points to their own expected closest center is minimized. No previous algorithms are known for this problem. In this paper, we present the first algorithm for this problem and it solves the problem in$$O(|G|+ m^{2}n^{2}\log mn)$$ O ( | G | + m 2 n 2 log m n ) time. 
    more » « less
  4. (, Proceedings of the 19th International Conference and Workshops on Algorithms and Computation (WALCOM 2025))
    Free, publicly-accessible full text available February 21, 2026
  5. ; ; (, Submitted for publication and arXiv:2412.02828)
    Accepted Manuscript Full Text Available
  6. ; (, Statistica Sinica)
    Full Text Available